/**
 * @program: leetcode064
 * @author: JCM
 * @create: 2023-03-07 20:32
 * @description:
 **/
public class Main {
    public int minPathSum(int[][] grid) {
        for(int i = 0; i < grid.length; i++) {
            for(int j = 0; j < grid[0].length; j++) {
                if(i == 0) {
                    grid[i][j] = j > 0 ? grid[i][j-1]+grid[i][j] : grid[i][j];
                }else if(j == 0) {
                    grid[i][j] = i > 0 ? grid[i-1][j]+grid[i][j] : grid[i][j];
                }else {
                    grid[i][j] = Math.min(grid[i-1][j],grid[i][j-1])+grid[i][j];
                }
            }
        }
        return grid[grid.length-1][grid[0].length-1];

    }
}
